The zero forcing number of a graph is the minimum cardinality among all the zero forcing sets of a graph $G$.  The aim of this article is to compute the zero forcing number of Complementary prism graphs.  Some bounds on the zero forcing number of Complementary prism graphs are presented. The remainder of this article discusses the following result.  Let $G$ and $\overline{G }$ be connected graphs. Then $Z(G\overline{G})\leq n-1$ if and only if  there exists two vertices $v_i,v_j \in V(G)$ and $i\neq j$ such that, either $N(v_i) \subseteq N(v_j)$ or $N[v_i] \subseteq N[v_j]$ in $G$.

The eccentricity of a vertex v of G is the largest distance between v and any other vertex in G. The reciprocal Complementary Wiener (RCW) index of G is defined as..

The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs Yn are equal to 7/4 for any n³5, and we will gave a partial answer to a question of Csirmaz [10]. We will also study the information ratio of two other families Cm×Cn and Pm×Cn and obtain the exact value of information ratio of these graphs.

Let G be a (p; q) graph. Let f: V (G)! f1; 2; : : :; kg be a map where k 2 N and k > 1. For each edge uv, assign the label gcd(f(u); f(v)). f is called k-Total prime cordial labeling of G if jtf (i) 􀀀 tf (j)j  1, i; j 2 f1; 2;


; kg where tf (x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of some graphs like prism, Helm, Dumbbell graph, Sun ower graph.

This study aimed to examine the brain signals of children with Autism Spectrum Disorder (ASD) and use a method according to the concept of Complementary opposites to obtain the prominent features or a pattern of EEG signal that represents the biological characteristic of such children. In this study, 20 children with the mean± SD age of 8± 5 years were divided into two groups of normal control (NC) and ASD. The diagnosis and approval of individuals in both groups were conducted by two experts in the field of pediatric psychiatry and neurology. The recording protocol was designed with the most accuracy; therefore, the brain signals were recorded with the least noise in the awake state of the individuals in both groups. Moreover, the recording was conducted in three stages from two channels (C3-C4) of EEG ( referred to as the central part of the brain) which were symmetrical in function. In this study, the Mandala method was adopted based on the concept of Complementary opposites to investigate the features extracted from Mandala pattern topology and obtain new features and pseudo-patterns for the screening and early diagnosis of ASD. The optimal feature here was based on different stages of processing and statistical analysis of Pattern Detection Capability (PDC). The PDC is a biomarker derived from the Mandala pattern for differentiating the NC from ASD groups.

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K2×H, where H is a path graph Pn, cyclic graph Cn, or star graph Sn, with n vertices (These are called: ladder graph, prism graph, and book graph).

In this paper, we enumerate the parameter matrices of all perfect 2-colorings of the generalized prism graph Cn × C3, where n ≥ 3,. We also present some generalized results for Cn × Cm, where m, n ≥ 3.